package leetcode;


/**
 * Created by DB_BOY on 2018/10/18.
 * 转置矩阵
 */
/*
    给定一个矩阵 A， 返回 A 的转置矩阵。

    矩阵的转置是指将矩阵的主对角线翻转，交换矩阵的行索引与列索引。



    示例 1：

    输入：[
            [1,2,3],
            [4,5,6],
            [7,8,9]]
    输出：[
            [1,4,7],
            [2,5,8],
            [3,6,9]]
    示例 2：

    输入：[
            [1,2,3],
            [4,5,6]]
    输出：[
            [1,4],
            [2,5],
            [3,6]]


    提示：

    1 <= A.length <= 1000
    1 <= A[0].length <= 1000
 */
public class TramsposeMatrix_867 {

    public static void main(String[] arrays) {
        int[][] a = new int[][]{
                {1, 2, 3},
                {4, 5, 6},
                {7, 8, 9}
        };
        System.out.println(solution(a));
    }

    private static int[][] solution(int[][] A) {
        int column = A[0].length, row = A.length;
        int[][] result = new int[column][row];
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                result[j][i] = A[i][j];
            }
        }
        return result;
    }
}
